منابع مشابه
Problemi di Partizione e Copertura
Siamo interessati a risolvere i seguenti problemi: Problema 1 (Covering Problem,CP) Trovare la copertura di costo totale minimo, cioè il sottoinsieme J ′ di J tale che: 1. Ognuna delle caselle è ricoperta da almeno un pezzo contenuto in J ; 2. La somma dei “costi” dei pezzi di J ′ è minima tra tutti i sottoinsiemi che soddisfano (1). Problema 2 (Partitioning Problem,PP) Trovare la partizione di...
متن کاملDecepcijski i teški optimizacijski problemi za genetske algoritme
Sažetak— Genetski algoritmi (GA) predstavljaju robusnu adaptivnu metodu uspješno primijenjenu na teške optimizacijske probleme. Međutim, oni također pokazuju i neke razočaravajuće rezultate što navodi na zaključak da postoje problemi koji su genetskom algoritmu teški za riješiti. Može se definirati barem četiri razloga (neprikladan izbor domene, decepcija, dijelovi sheme ne mogu biti točno proc...
متن کاملHASTA: A Hierarchical-Grid Clustering Algorithm with Data Field
In this paper, a novel clustering algorithm, HASTA (HierArchical-grid cluStering based on daTA field), is proposed to model the dataset as a data field by assigning all the data objects into qusantized grids. Clustering centers of HASTA are defined to locate where the maximum value of local potential is. Edges of cluster in HASTA are identified by analyzing the first-order partial derivative of...
متن کاملHasta-La-Vista: Termination Analyser for Logic Programs
Verifying termination is often considered as one of the most important aspects of program verification. Logic languages, allowing us to program declaratively, increase the danger of non-termination. Therefore, termination analysis received considerable attention in logic programming (see e.g. [7, 8, 10, 16]). Unfortunately, the majority of existing termination analysers, such as TermiLog [15], ...
متن کاملOn Pebble Automata for Data Languages with Decidable Emptiness ProblemI,II
In this paper we study a subclass of pebble automata (PA) for data languages for which the emptiness problem is decidable. Namely, we show that the emptiness problem for weak 2-pebble automata is decidable, while the same problem for weak 3-pebble automata is undecidable. We also introduce the so-called top view weak PA. Roughly speaking, top view weak PA are weak PA where the equality test is ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bitlis Eren Üniversitesi Sosyal Bilimler Dergisi
سال: 2020
ISSN: 2147-5962
DOI: 10.47130/bitlissos.772901